Theorem E is the formula for the Number String’s Living Average, the 1st derivative.
"Induction Principle. A statement Q(n) about the integer n is true for all positive integers n if
1. Q(1) is true.
2. For each integer n, the truth of Q(n) implies the truth of Q(n+1); that is, if Q(n) is true then Q(n+1) is true.
The truth of Q(n) is often called the induction hypothesis, since it is the hypothesis of the implication of property 2." (Burton W. Jones, An Introduction to Modern Algebra, 1975, p. 132)
Theorem F is the formula for the Number String’s 1st Directional, the 2nd derivative.
A common calculus theorem states that:
Theorem I: As N, the number of Living Algorithm iterations, increases, the Number String's Living Average approaches A, the Number String's content.
Theorem K: As N, the number of Living Algorithm iterations increases, the Number String's 2nd Directional approaches 0 as a limit.
Theorem L: The Change Series written in terms of the Directionals & the Data
Theorem M: an alternate expression for the Mth Directional.
Theorem N: as N approaches infinity, all the Number String's Directionals approach 0.
Theorem O: All Directionals of the Number String Data Stream equal the product of the Number String's Content, A, and a constant, C, which is a function of D, the Decay Factor.